Dirac's minimum degree condition restricted to claws
نویسندگان
چکیده
منابع مشابه
Dirac's minimum degree condition restricted to claws
Let G be a graph on n t> 3 vertices. Dirac's minimum degree condition is the condition that all vertices of G have degree at least in. This is a well-known sufficient condition for the existence of a Hamilton cycle in G. We give related sufficiency conditions for the existence of a Hamilton cycle or a perfect matching involving a restriction of Dirac's minimum degree condition to certain subset...
متن کاملMinimum degree condition forcing complete graph immersion
An immersion of a graph H into a graph G is a one-to-one mapping f : V (H) → V (G) and a collection of edge-disjoint paths in G, one for each edge of H , such that the path Puv corresponding to edge uv has endpoints f(u) and f(v). The immersion is strong if the paths Puv are internally disjoint from f(V (H)). It is proved that for every positive integer t, every simple graph of minimum degree a...
متن کاملMinimum degree condition for C4-tiling in 3-uniform hypergraphs
We show that there is n0 such that if H is a 3-uniform hypergraph on n ∈ 4Z, n ≥ n0, vertices such that δ1(H) ≥ ( n−1 2 ) − ( 3n/4 2 ) + 3n 8 + 1 2 , then H can be tiled with copies of C4, the unique 3-uniform hypergraph on four vertices with two edges. The degree condition is tight when 8|n.
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملUsing minimum degree to bound average distance
Total and average distance are not only interesting invariants of graphs in their own right but are also used for studying properties or classifying graphical systems that depend on the number of edges traversed. Recent examples include studies of computer networks [3] and the use of graphical invariants to partially classify the structure of molecules [1]. There have been a number of conjectur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00224-5